Real Hypercomputation with Infinite Oracle Queries
نویسنده
چکیده
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable function into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation ([4], [5]) are shown to be special cases of Oracle-Type-2Machines. Our approach offers an intuitive definition of the weakest machine model capable to simulate both Type-2-Machines ([3]) and BSS machines ([1]). As an example for applications, we can derive some results on functions definable by arithmetic circuits similar to [2].
منابع مشابه
Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation or Typ...
متن کاملOracle Turing machines faced with the verification problem
The main current issue about hypercomputation concern the following thesis: it is physically possible to build a hypercomputation model. To prove this thesis, one possible strategy could be to physically build an oracle Turing machine. More precisely, it is about finding a physical theory where a hypercomputation model will be able to use some external information from nature. Such an informati...
متن کاملReal Hypercomputation and Degrees of Discontinuity
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS 2000), Brattka (MLQ2005), and Ziegler (ToCS 2006) have considered different relaxed notions of computability to cover also discontinuous functions. The present work compares and unifies these approaches. This is based on the concept of the jump of a r...
متن کاملar X iv : c s / 05 08 06 9 v 1 [ cs . L O ] 1 5 A ug 2 00 5 Real Hypercomputation and Continuity ⋆
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of hypercomputation allow for the effective evaluation of also discontinuous f : R → R. More precisely the present work considers the following three super-Turing notions of real function computability: – relativized computation; specifically...
متن کاملPhysical constraints on hypercomputation
“To infinity, and beyond!”, Buzz Lightyear, Toy Story, Pixar, 1995. Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to bounded or discrete, computation. Thus, such schemes may include the deployment of actualised rat...
متن کامل